منابع مشابه
Three Companions for Rst Order Data Mining
Three companion systems, Claudien, ICL and Tilde, are presented. They use a common representation for examples and hypotheses: each example is represented by a relational database. This contrasts with the classical inductive logic programming systems such as Progol and Foil. It is argued that this representation is closer to attribute value learning and hence more natural. Furthermore, the thre...
متن کاملAn Efficient Approach for Association Rule Mining
A great research work has been done in last decade in association rules mining (ARM) algorithms . Therefore, various algorithms were proposed to discover frequent item sets and then mine association rules. Apriori algorithm is the most frequently used algorithm for generating association rules. Apriori algorithm has some abuses, such as too many scans of the database, large load of system’s I/O...
متن کاملBlack hole mining in the RST model
Rohitvarma Basavaraju∗ and David A. Lowe† Department of Physics, Brown University, Providence, RI 02912, USA (Dated: November 8, 2016) Abstract We consider the possibility of mining black holes in the 1+1-dimensional dilaton gravity model of Russo, Susskind and Thorlacius. The model correctly incorporates Hawking radiation and backreaction in a semiclassical expansion in 1/N , where N is the nu...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملThree Companions for Data Mining in Rst Order Logic
Three companion systems, Claudien, ICL and Tilde, are presented. They use a common representation for examples and hypotheses: each example is represented by a relational database. This contrasts with the classical inductive logic programming systems such as Progol and Foil. It is argued that this representation is closer to attribute value learning and hence more natural. Furthermore, the thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bonfring International Journal of Data Mining
سال: 2014
ISSN: 2250-107X,2277-5048
DOI: 10.9756/bijdm.10365